此一課程在於介紹多種常用之資料結構與相關演算法，增進修課學生的程式設計能力，以期未來能在不同領域實際應用。 內如預訂涵蓋：
1: Fundamentals introduces a scientific and engineering basis for comparing algorithms and making predictions. It also includes our programming model.
2: Sorting considers several classic sorting algorithms, including insertion sort, mergesort, and quicksort. It also includes a binary heap implementation of a priority queue.
3: Searching describes several classic symbol table implementations, including binary search trees, red-black trees, and hash tables.
4: Graphs surveys the most important graph processing problems, including depth-first search, breadth-first search, minimum spanning trees, and shortest paths.
5 (optional): Strings investigates specialized algorithms for string processing, including radix sorting, substring search, tries, regular expressions, and data compression.